Sequences realized as Parker vectors of oligomorphic permutation groups
نویسندگان
چکیده
The purpose of this paper is to study the Parker vectors (in fact, sequences) of several known classes of oligomorphic groups. The Parker sequence of a group G is the sequence that counts the number of G-orbits on cycles appearing in elements of G. This work was inspired by Cameron’s paper on the sequences realized by counting orbits on k-sets and k-tuples.
منابع مشابه
Parker Vectors for Infinite Groups
We take the first step towards establishing a theory of Parker vectors for infinite permutation groups, with an emphasis towards oligomorphic groups. We show that, on the one hand, many results for finite groups extend naturally to the infinite case (Parker’s Lemma, multiplicative properties, etc.), while on the other, in the infinite case some genuinely new phenomena arise. We also note that c...
متن کاملInfinite Permutation Groups in Enumeration and Model Theory
A permutation group G on a set Q has a natural action on Q for each natural number n. The group is called oligomorphic if it has only finitely many orbits on Q for all «GN. (The term means "few shapes". Typically our permutation groups are groups of automorphisms of structures of some kind; oligomorphy implies that the structure has only finitely many non-isomorphic w-element substructures for ...
متن کاملPermutation Group Algebras
We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which would show that the algebra is an integral domain if, in addition, the group is oligomorphic. We go on to show that this conjecture is true in certain special ca...
متن کاملCycle Action on Treelike Structures
The purpose of this paper is to study the action on cycles of several known classes of oligomorphic groups, that is, infinite permutation groups of countable degree having only finitely many orbits on k-sets for each k. The groups studied here are all related to trees and treelike relational structures. The sequence whose k-th term is the number of orbits in the action on k-cycles is called Par...
متن کاملOligomorphic permutation groups
A permutation group G (acting on a set Ω, usually infinite) is said to be oligomorphic if G has only finitely many orbits on Ωn (the set of n-tuples of elements of Ω). Such groups have traditionally been linked with model theory and combinatorial enumeration; more recently their group-theoretic properties have been studied, and links with graded algebras, Ramsey theory, topological dynamics, an...
متن کامل